Connection Machine Stereomatching
نویسنده
چکیده
This paper describes a parallel real-time stereomatching algorithm and its implementation on the Connection MachineTM computing system. computer, a new massively parallel The main features of the algorithm are 1) real-time performance, 2) the full exploitation of the OPdering constraint, 3) a representation that easily maps onto a parallel computer architecture, and 4) the ability to efficiently use a variety of matching primitives. Some results, including timings, are shown for both real and synthetic data. Also discussed are the use of color information and some subtle variations of the basic algorithm.
منابع مشابه
Neural model of visual stereomatching: slant, transparency and clouds
Stereomatching of oblique and transparent surfaces is described using a model of cortical binocular ‘tuned’ neurons selective for disparities of individual visual features and neurons selective for the position, depth and 3D orientation of local surface patches. The model is based on a simple set of learning rules. In the model, monocular neurons project excitatory connection pathways to binocu...
متن کاملLine-Constrained Camera Location Estimation in Multi-Image Stereomatching
Stereomatching is an effective way of acquiring dense depth information from a scene when active measurements are not possible. So-called lightfield methods take a snapshot from many camera locations along a defined trajectory (usually uniformly linear or on a regular grid-we will assume a linear trajectory) and use this information to compute accurate depth estimates. However, they require the...
متن کاملAssessment of Dem Quality for Characterizing Surface Roughness Using Close Range Digital Photogrammetry
This paper presents a procedure for assessing the quality of a digital elevation model (DEM) which has been applied to the output of a normalized cross correlation based stereomatching algorithm. Using semimetric photography of natural gravel river bed surfaces acquired in the field, digital photogrammetry was used to extract DEMs automatically for use in characterizing surface roughness proper...
متن کاملAccelerated learning on the connection machine
The complexity of most machine learning techniques can be improved by transforming iterative components into their parallel equivalent. Although this parallelization has been considered in theory, few implementations have been performed on existing parallel machines. The parallel architecture of the Connection Machine provides a platform for the implementation and evaluation of parallel learnin...
متن کاملRecognition Algorithms for the Connection Machine
This paper describes an object recognition algorithm both on a sequential machine and on a SIMD parallel processor such as the MIT Connection Machine. The parallel version is shown to run three to four orders of magnitude faster than the sequential version.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986